Algorithms for Visualizing Large Networks

نویسنده

  • Yifan Hu
چکیده

Graphs are often used to encapsulate relationship between objects. Graph drawing enables visualization of such relationships. The usefulness of this visual representation is dependent on whether the drawing is aesthetic. While there are no strict criteria for aesthetics of a drawing, it is generally agreed, for example, that such a drawing has minimal edge crossing, with vertices evenly distributed in the space, connected vertices close to each other, and with symmetry that may exist in the graph preserved. One of the earliest example of graph drawing is probably the Mill (also known as Morris) game boards, found in the 13th century The Book of Games, produced under the direction of Alfonso X (1221-1284), King of Castile (Spain). Other examples of early graph drawing are drawings of family trees, and trees of virtues and vices. In 1735, Euler presented and later published his famous paper [13] on the Seven Bridges of Königsberg. The problem was to find a walk through the city of Königsberg, which include two islands connected to the mainland by seven bridges (Figure 1). The walk must cross each bridge once and only once. Euler proved that such a walk is not possible. Euler’s paper laid the foundation of graph theory. Interestingly, however, Euler did not provide a drawing of the graph representation of the problem itself in the paper. In the 18th century, the Irish physicist, astronomer, and mathematician, William Hamilton, invented the Iconsian game. To play the game, one has to visit every node of a dodecahedral graph once, and back to the starting node. Every edge can be passed at most once. In 1857 he sold the game to a London game dealer for 25 Pounds (about 3000 US dollars in today’s money after taking into account of inflation). The dealer made two versions; unfortunately, neither sold well, probably because the game was so simple that even a child could succeed. Around the same time, British mathematician Arthur Cayley wrote a paper on the enumeration of tree diagrams. In the paper he pioneered the

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID CHARGED SYSTEM SEARCH - FIREFLY ALGORITHM FOR OPTIMIZATION OF WATER DISTRIBUTION NETWORKS

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...

متن کامل

A Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem

Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...

متن کامل

Two new heuristic algorithms for Covering Tour Problem

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

متن کامل

Algorithms for Visualizing Phylogenetic Networks

We study the problem of visualizing phylogenetic networks, which are extensions of the Tree of Life in biology. We use a space filling visualization method, called DAGmaps, in order to obtain clear visualizations using limited space. In this paper, we restrict our attention to galled trees and galled networks and present linear time algorithms for visualizing them as DAGmaps.

متن کامل

iCAVE: an open source tool for visualizing biomolecular networks in 3D, stereoscopic 3D and immersive 3D

Visualizations of biomolecular networks assist in systems-level data exploration in many cellular processes. Data generated from high-throughput experiments increasingly inform these networks, yet current tools do not adequately scale with concomitant increase in their size and complexity. We present an open source software platform, interactome-CAVE (iCAVE), for visualizing large and complex b...

متن کامل

A Novel Comprehensive Taxonomy of Intelligent-Based Routing Protocols in Wireless Sensor Networks

Routing in ad-hoc networks, specifically intelligent-based ones, is a highly interested research topic in recent years. Most of them are simulation-based study. Large percentages have not even mentioned some of the fundamental parameters. This strictly reduces their validity and reliability. On the other hand, there is not a comprehensive framework to classify routing algorithms in wireless sen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010